The Maximum Disjoint Set of Boundary Rectangles
نویسندگان
چکیده
We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are attached to the boundary of a bounding box. We present an algorithm for solving the problem in O(n) time, improving upon the best previous O(n)-time solution available for the problem.
منابع مشابه
Packing Boundary-Anchored Rectangles
In this paper, we study the boundary-anchored rectangle packing problem in which we are given a set P of points on the boundary of an axis-aligned squareQ. The goal is to find a set of disjoint axis-aligned rectangles in Q such that each rectangle is anchored at some point in P , each point in P is used to anchor at most one rectangle, and the total area of the rectangles is maximized. We show ...
متن کاملThe Maximum Disjoint Routing Problem
Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n log n log log n) time, improving ove...
متن کاملMaximum independent set of rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axis-parallel rectangles, find a maximum-cardinality subset of disjoint rectangles. MISR is a special case of the classical Maximum Independent Set problem, where the input is restricted to intersection graphs of axis-parallel rectangles. Due to its many applications, ranging from map labeling to data m...
متن کاملIlluminating Rectangles and Triangles in the Plane
A set S of light sources, idealized as points, illuminates a collection F of convex sets if each point in the boundary of the sets of F is visible from at least one point in S. For any n disjoint plane isothetic rectangles, Î(4n+4)/3 ̊ lights are sufficient to illuminate their boundaries. If in addition, the rectangles have equal width, then n+1 lights always suffice and n-1 are occasionally nec...
متن کاملComputing conforming partitions of orthogonal polygons with minimum stabbing number
Let P be an orthogonal polygon with n vertices. A partition of P into rectangles is called conforming if it results from cutting P along a set of interior-disjoint line segments, each having both endpoints on the boundary of P . The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any orthogonal line segment inside P . In this paper, we consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014